Lurupa - Rigorous Error Bounds in Linear Programming
نویسنده
چکیده
Rigorous Error Bounds in Linear Programming Christian Keil Hamburg University of Te hnology, Institute for Reliable Computing .keil tu-harburg.de Abstra t. Linear Programming has numerous appli ations. Re ently it has been shown that many real world problems exhibit numeri al di ulties due to illonditioning. This paper des ribes Lurupa, a software pa kage for omputing rigorous bounds for the optimal value of a linear program. The pa kage an handle point and interval problems. Numeri al experien e with the Netlib lp library is given.
منابع مشابه
Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library
The Netlib library of linear programming problems is a well known suite containing many real world applications. Recently it was shown by Ordóñez and Freund that 71% of these problems are ill-conditioned. Hence, numerical difficulties may occur. Here, we present rigorous results for this library that are computed by a verification method using interval arithmetic. In addition to the original in...
متن کاملRigorous bounds on the stationary distributions of the chemical master equation via mathematical programming
The stochastic dynamics of networks of biochemical reactions in living cells are typically modelled using chemical master equations (CMEs). The stationary distributions of CMEs are seldom solvable analytically, and few methods exist that yield numerical estimates with computable error bounds. Here, we present two such methods based on mathematical programming techniques. First, we use semidefin...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملRigorous Error Bounds for the Optimal Value in Semidefinite Programming
A wide variety of problems in global optimization, combinatorial optimization as well as systems and control theory can be solved by using linear and semidefinite programming. Sometimes, due to the use of floating point arithmetic in combination with ill-conditioning and degeneracy, erroneous results may be produced. The purpose of this article is to show how rigorous error bounds for the optim...
متن کامل